The oriented bicyclic graphs whose skew-spectral radii do not exceed 2
نویسندگان
چکیده
منابع مشابه
Ordering the oriented unicyclic graphs whose skew-spectral radius is bounded by 2
*Correspondence: [email protected] 2School of Science, Zhejiang A&F University, Hangzhou, 311300, China Full list of author information is available at the end of the article Abstract Let S(G ) be the skew-adjacency matrix of an oriented graph G with n vertices, and let λ1,λ2, . . . ,λn be all eigenvalues of S(G ). The skew-spectral radius ρs(G ) of G is defined as max{|λ1|, |λ2|, . . . , |λn|}....
متن کاملNew skew equienergetic oriented graphs
Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...
متن کاملon the skew spectral moments of graphs
let $g$ be a simple graph, and $g^{sigma}$ be an oriented graph of $g$ with the orientation $sigma$ and skew-adjacency matrix $s(g^{sigma})$. the $k-$th skew spectral moment of $g^{sigma}$, denoted by $t_k(g^{sigma})$, is defined as $sum_{i=1}^{n}( lambda_{i})^{k}$, where $lambda_{1}, lambda_{2},cdots, lambda_{n}$ are the eigenvalues of $g^{sigma}$. suppose $g^{sigma...
متن کاملEla Some Results on the Spectral Radii of Trees, Unicyclic, and Bicyclic Graphs
Let ∆(G), ∆ for short, be the maximum degree of a graph G. In this paper, trees (resp., unicyclic graphs and bicyclic graphs), which attain the first and the second largest spectral radius with respect to the adjacency matrix in the class of trees (resp., unicyclic graphs and bicyclic graphs) with n vertices and the maximum degree ∆, where ∆ ≥ n+1 2 (resp., ∆ ≥ n 2 +1 and ∆ ≥ n+3 2 ) are determ...
متن کاملSome results on the spectral radii of trees, unicyclic and bicyclic graphs
Let ∆(G), ∆ for short, be the maximum degree of a graph G. In this paper, trees (resp., unicyclic graphs and bicyclic graphs), which attain the first and the second largest spectral radius with respect to the adjacency matrix in the class of trees (resp., unicyclic graphs and bicyclic graphs) with n vertices and the maximum degree ∆, where ∆ ≥ n+1 2 (resp., ∆ ≥ n 2 +1 and ∆ ≥ n+3 2 ) are determ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2015
ISSN: 1029-242X
DOI: 10.1186/s13660-015-0848-4